Parallelized Radix-4 Scalable Montgomery Multipliers
نویسندگان
چکیده
منابع مشابه
Parallelized Booth-Encoded Radix-4 Montgomery Multipliers
This paper proposes two parallelized radix-4 scalable Montgomery multiplier implementations. The designs do not require precomputed hard multiples of the operands, but instead uses Booth encoding to compute products. The designs use a novel method for propagating the sign bits for negative partial products. The first design right shifts operands to reduce critical path length when using Booth e...
متن کاملFPGA Design, Implementation and Analysis of Scalable Low Power Radix 4 Montgomery Multiplication Algorithm
This paper proposes an efficient algorithm and Processing Element (PE) architecture for a Multiple Word Radix 4 Montgomery Modular (MWR4MM) multiplier. This architecture is developed considering an important design factor power consumption in addition to other design factors that is considered previously in many publications such as performance and scalability. To increase performance, we used ...
متن کاملHigh-Performance and Area-Efficient Hardware Design for Radix-2 Montgomery Multipliers
Montgomery multiplication is one of the fundamental operations used in cryptographic systems. The nowclassic hardware architecture for implementing MultipleWord Radix-2 Montgomery Multiplication (MWR2MM) was proposed by Tenca and Koç in CHES 1999. This architecture performs a single Montgomery multiplication in approximately 2n clock cycles, where n is the size of operands in bits. In this pape...
متن کاملHigh speed Radix-4 Booth scheme in CNTFET technology for high performance parallel multipliers
A novel and robust scheme for radix-4 Booth scheme implemented in Carbon Nanotube Field-Effect Transistor (CNTFET) technology has been presented in this paper. The main advantage of the proposed scheme is its improved speed performance compared with previous designs. With the help of modifications applied to the encoder section using Pass Transistor Logic (PTL), the corresponding capacitances o...
متن کاملNathaniel Pinckney and David Money
ABSTRACT This paper describes a parallelized radix-4 scalable Montgomery multiplier implementation. The design does not require hardware multipliers, and uses parallelized multiplication to shorten the critical path. By left-shifting the sources rather than right-shifting the result, the latency between processing elements is shortened from two cycles to nearly one. The new design can perform 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Integrated Circuits and Systems
سال: 2008
ISSN: 1872-0234,1807-1953
DOI: 10.29292/jics.v3i1.280